Improved Beluga Whale Optimization for Solving the Simulation Optimization Problems with Stochastic Constraints
نویسندگان
چکیده
Simulation optimization problems with stochastic constraints are deterministic cost functions subject to constraints. Solving the considered problem by traditional approaches is time-consuming if search space large. In this work, an approach integration of beluga whale and ordinal presented resolve in a relatively short time frame. The proposed composed three levels: emulator, diversification, intensification. Firstly, polynomial chaos expansion treated as emulator evaluate design. Secondly, improved seek N candidates from whole space. Eventually, advanced optimal computational effort allocation adopted determine superior design candidates. utilized number service providers for minimizing staffing costs while delivering specific level care emergency department healthcare. A practical example six cases used verify approach. CPU consumes less than one minute cases, which demonstrates that can meet requirement real-time application. addition, compared five heuristic methods. Empirical tests indicate efficiency robustness
منابع مشابه
An improved genetic algorithm for solving simulation optimization problems
Simulation optimization studies the problem of optimizing simulation-based objectives. Simulation optimization is a new and hot topic in the field of system simulation and operational research. To improve the search efficiency, this paper presents a hybrid approach which combined genetic algorithm and local optimization technique for simulation optimization problems. Through the combination of ...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملMultiobjective Stochastic Optimization Problems with Probability Constraints
Multiobjective optimization problems depending on a probability measure often correspond to situations in which an economic or financial process is simultaneously influenced by a random factor and a decision parameter. Moreover it is reasonable to evaluate the process by a few objective functions and it seems reasonable to determine the “decision” with respect to the mathematical expectation of...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کامل1999: Solving Stochastic Optimization Problems with Stochastic Constraints: an Application in Network Design
Recently sample-path methods have been successfully used in solving challenging simulation optimization and stochastic equilibrium problems. In this paper we deal with a variant of these methods to solve stochastic optimization problems with stochastic constraints. Using optimality conditions, we convert the problem to a stochastic variational inequality. We outline a set of sufficient conditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11081854